Space-Efficient Las Vegas Algorithms for K-SUM
نویسنده
چکیده
Using hashing techniques, this paper develops a family of space-efficient Las Vegas randomized algorithms for k-SUM problems. This family includes an algorithm that can solve 3-SUM in O(n) time and O( √ n) space. It also establishes a new time-space upper bound for SUBSETSUM, which can be solved by a Las Vegas algorithm in O(2 √ 8 9 ) time and O(2) space, for any β ∈ [0, 9 32 ].
منابع مشابه
Space-Efficient Randomized Algorithms for K-SUM
Recent results by Dinur et al. (2012) and Austrin et al. (2013) have improved the time-space tradeoff curve for SubsetSum. We analyze a family of hash functions previously introduced by Dietzfelbinger, and apply it to decompose arbitrary k-Sum instances into smaller ones. This allows us to extend the aforementioned tradeoff curve to the k-Sum problem, which is SubsetSum restricted to sets of si...
متن کاملSpace-Efficient Parallel Algorithms for Combinatorial Search Problems
We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving the visit of an n-node tree of height h under the assumption that a node can be accessed only through its father or its children. For both problems we propose efficient algorithms that run on a distributed-memory machine with p processor...
متن کامل1 . 2 Application : Lower Bounds on Las Vegas Randomized Algorithms
In this section, we will first prove that any 2-player zero-sum finite game has a Nash equilibrium of mixed strategies (a special case of Nash’s theorem), and a Nash equilibrium can be found through solving linear programs. We will further show how to prove lower bounds on randomized complexity of Las Vegas algorithms using this result. A 2-player game is a zero-sum game if the sum of the payof...
متن کاملProbabilistic Computability and Choice
We study the computational power of randomized computations on infinite objects, such as real numbers. In particular, we introduce the concept of a Las Vegas computable multi-valued function, which is a function that can be computed on a probabilistic Turing machine that receives a random binary sequence as auxiliary input. The machine can take advantage of this random sequence, but it always h...
متن کاملThe shifted number system for fast linear algebra on integer matrices
The shifted number system is presented: a method for detecting and avoiding error producing carries during approximate computations with truncated expansions of rational numbers. Using the shifted number system the high-order lifting and integrality certification techniques of Storjohann 2003 for polynomial matrices are extended to the integer case. Las Vegas reductions to integer matrix multip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1303.1016 شماره
صفحات -
تاریخ انتشار 2013